Reductions between scheduling problems with non-renewable resources and knapsack problems
نویسندگان
چکیده
منابع مشابه
Reductions between scheduling problems with non-renewable resources and knapsack problems
In this paper we establish approximation preserving reductions between scheduling problems in which jobs either consume some raw materials, or produce some intermediate products, and variants of the knapsack problem. Through the reductions, we get new approximation algorithms, as well as inapproximability results for the scheduling problems.
متن کاملKnapsack problems with setups
RÉSUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a DantzigWolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary knapsack problem with setups, items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their ...
متن کاملApproximation schemes for parallel machine scheduling with non-renewable resources
In this paper the approximability of parallel machine scheduling problems with resource consuming jobs is studied. In these problems, in addition to a parallel machine environment, there are non-renewable resources, like raw materials, energy, or money, consumed by the jobs. Each resource has an initial stock, and some additional supplies at a-priori known moments of times and in known quantiti...
متن کاملModelling Planning and Scheduling Problems with Time and Resources
Planning and scheduling are close areas but on the other hand, they use very different solving technologies. Recently, there is a strong demand from industry to integrate both approaches into a single system. In the paper we propose a basic framework for modelling planning and scheduling problems that involve reasoning about time and resources. In this framework we go beyond the traditional def...
متن کاملKnapsack Problems with Random Budgets
Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem in which the budget is random. We propose two different formulations of this problem, based on diffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.007